Computer Processing and Outcome Prediction Systems and Methods

ABSTRACT

Computer processing and outcome prediction systems and methods used to generate algorithm time prediction polynomials, inverse algorithm time prediction polynomials, determine race conditions, determine when a non-linear algorithm can be treated as if it were linear, as well as automatically generate parallel and quantum solutions from classical software or from the relationship between monotonic attribute values.

PRIORITY

This Application is a continuation of U.S. patent application Ser. No.16/730,607, filed Dec. 30, 2019, which claims priority to and thebenefit of U.S. Provisional Patent Application No. 62/786,951, filedDec. 31, 2018; with each of the referenced applications and disclosuresfully incorporated herein by reference.

TECHNICAL FIELD

The present invention relates generally to systems, methods, andcomputer programs for processing outcome predictions.

BACKGROUND OF THE INVENTION

Many seemingly disparate conventional software goods and services arenot efficient or, in some cases, fail to provide any available optionsat all, for predicting values or outcomes pertaining to software timing,software parallelization, software analytics, quantum circuit encoding,projectile or vehicle intercept information, and the like. Theseconcepts are treated as unrelated and require different toolsets. Thetoolsets required for the different software products can be verysophisticated, requiring an expensive specialist in difficult topicslike Discrete Fourier Transformations, Partial Differential Equations,Artificial Intelligence, and the like. Some of the topics like trueautomatic transformation of serial software into strong parallelsoftware without human intervention, general software processing timeprediction from input values, and the general transformation of classicalgorithms to quantum circuit capable algorithms, have not heretoforebeen possible. Only the weak software solution form or partial solutionforms have been successfully accomplished.

As such, there is a need for new and improved computing systems andmethods to address these deficiencies.

SUMMARY OF THE INVENTION

The systems and methods of the present invention provide linkedtechniques for a new non-linear, curve-fitting method that uses searchesrather than calculations to build a polynomial that defines the best fitof a set of points to a curve, a new method by which to decompose asoftware source code such that the processing time of that code can beobtained, and a new method by which the execution path of software codecan be known by examining the input variable values given to that code.

The techniques and methods of the present invention can be used topredict projectile or vehicle intercept times and locations, toautomatically generate software timing and race condition tests, toparallelize a general software code, and to automatically generateparallel and quantum solutions from classical software or from therelationship between monotonic attribute values. Further, the presentinvention can generate various software analytics, including processingtime, parallel processing speedup, parallel processing overhead,software power consumption. The present invention can also be used tosolve other timing and processing resource needs or issues.

Aspects, methods, processes, systems and embodiments of the presentinvention are described below with reference to the accompanyingdrawings.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated herein and form partof the specification, illustrate various embodiments of the presentdisclosure and, together with the description, further explain theprinciples of the disclosure and to enable a person skilled in thepertinent art to make and use the embodiments disclosed herein. In thedrawings, like reference numbers indicate identical or functionallysimilar elements.

FIG. 1 shows a process for decomposing a software unit, generatingpolynomials, and generating the time complexity functions, in accordancewith embodiments of the present invention.

FIG. 2 shows an example of Turing's second temporal ambiguity, inaccordance with embodiments of the present invention.

FIG. 3 shows multiple exemplary software units, and correspondingtables, for multiple pathways which will become time-affecting linearpathways (TALPs), in accordance with embodiments of the presentinvention.

FIG. 4 shows an exemplary TALP Selection Table (TST), in accordance withembodiments of the present invention.

FIG. 5 shows an exemplary TALP creation using software units, inaccordance with embodiments of the present invention.

FIG. 6 shows the creation an exemplary TALP Selection Function (TSF), inaccordance with embodiments of the present invention.

FIG. 7 shows an exemplary table including example input attribute valuesand time, in accordance with embodiments of the present invention.

FIG. 8 shows an exemplary Source Value Table, in accordance withembodiments of the present invention.

FIG. 9 shows an exemplary Target Values Table, in accordance withembodiments of the present invention.

FIG. 10 shows an exemplary new Source Values Table, in accordance withembodiments of the present invention.

FIG. 11 shows exemplary tables demonstrating row shifting based oncomputed zero values from a new Source Values Table, in accordance withembodiments of the present invention.

FIGS. 12A-12B show exemplary tables combining and comparing values fromSource Value Tables and Target Value Tables, in accordance withembodiments of the present invention.

FIG. 13 shows an exemplary dual header table illustrating obtaining theinverse function of each term at the same time as the function of eachterm is obtained, in accordance with embodiments of the presentinvention.

FIG. 14 shows an exemplary temporal/spatial relationship graph, inaccordance with embodiments of the present invention.

FIG. 15 shows exemplary code related to terms used in connection withTALP time prediction, in accordance with embodiments of the presentinvention.

FIG. 16 shows exemplary code demonstrating static and variableprocessing times, in accordance with embodiments of the presentinvention.

FIG. 17 shows exemplary tables created for a first use case TALP tocompare to a previously created Target Values Table to generate a timecomplexity function, in accordance with embodiments of the presentinvention.

FIGS. 18-19 shows exemplary processing for multiple attribute TALPtiming prediction, in accordance with embodiments of the presentinvention.

FIG. 20 shows exemplary code for a second use case illustrating thecreation of a time complexity function using multiple attributes, inaccordance with embodiments of the present invention.

FIGS. 21-22 show exemplary tables of timing results for the second usecase of FIG. 20 , in accordance with embodiments of the presentinvention.

FIG. 23 shows an exemplary process relating to software timing tests, inaccordance with embodiments of the present invention.

FIG. 24 shows an exemplary process relating to automatic software codeparallelization, in accordance with embodiments of the presentinvention.

FIG. 25 shows an exemplary TALP modification, in accordance withembodiments of the present invention.

FIGS. 26-32 show data movement patterns with exemplary stencils, inaccordance with embodiments of the present invention.

FIG. 33 shows an exemplary dependent variable table, in accordance withembodiments of the present invention.

FIG. 34 shows an exemplary diagram of quantum code creation using TALPs,in accordance with embodiments of the present invention.

FIG. 35 shows an exemplary projectile or vehicle intercept determinationprocess, in accordance with embodiments of the present invention.

FIG. 36 shows an exemplary time-coordinate graph demonstrating amonotonic polynomial behaving linearly with correct framework, inaccordance with embodiments of the present invention.

FIG. 37 shows an exemplary graph demonstrating a polynomial alsobehaving linearly within a framework, in accordance with embodiments ofthe present invention.

FIG. 38 shows an exemplary graph demonstrating multiple non-linearpolynomials behaving linearly within a monotonic non-linear framework,in accordance with embodiments of the present invention.

FIG. 39 shows an exemplary time-c values relationship graphdemonstrating optimum predicted intercept points (PIP), in accordancewith embodiments of the present invention.

FIG. 40 shows an exemplary graph demonstrating distance between “Ownship” and optimum intercept locations, in accordance with embodiments ofthe present invention.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

Referring generally to FIGS. 1-40 , exemplary aspects of computingsystems and methods 100 for advanced outcome predictions is provided.

Various devices or computing systems can be included and adapted toprocess and carry out the aspects, computations, and algorithmicprocessing of the software systems and methods of the present invention.Computing systems and devices of the present invention may include aprocessor, which may include one or more microprocessors and/or one ormore circuits, such as an application specific integrated circuit(ASIC), field-programmable gate arrays (FPGAs), etc. Further, thedevices can include a network interface. The network interface isconfigured to enable communication with a communication network, otherdevices and systems, and servers, using a wired and/or wirelessconnection.

The devices or computing systems may include memory, such asnon-transitive, which may include one or more non-volatile storagedevices and/or one or more volatile storage devices (e.g., random accessmemory (RAM)). In instances where the computing devices include amicroprocessor, computer readable program code may be stored in acomputer readable medium or memory, such as, but not limited to drivemedia (e.g., a hard disk or SSD), optical media (e.g., a OVO), memorydevices (e.g., random access memory, flash memory), etc. The computerprogram or software code can be stored on a tangible, or non-transitive,machine-readable medium or memory. In some embodiments, computerreadable program code is configured such that when executed by aprocessor, the code causes the device to perform the steps describedabove and herein. In other embodiments, the device is configured toperform steps described herein without the need for code.

It will be recognized by one skilled in the art that these operations,algorithms, logic, method steps, routines, sub-routines, and modules maybe implemented in software, in firmware, in special purpose digitallogic, and any combination thereof without deviating from the spirit andscope of the present invention as recited within the claims attachedhereto.

The devices or computing devices may include an input device. The inputdevice is configured to receive an input from either a user (e.g.,admin, user, etc.) or a hardware or software component—as disclosedherein in connection with the various user interface or automatic datainputs. Examples of an input device include a keyboard, mouse,microphone, touch screen and software enabling interaction with a touchscreen, etc. The devices can also include an output device. Examples ofoutput devices include monitors, televisions, mobile device screens,tablet screens, speakers, remote screens, etc. The output device can beconfigured to display images, media files, text, video, or play audio toa user through speaker output.

Server processing systems for use or connected with the systems of thepresent invention, can include one or more microprocessors, and/or oneor more circuits, such as an application specific integrated circuit(ASIC), field-programmable gate arrays (FPGAs), etc. A network interfacecan be configured to enable communication with a communication network,using a wired and/or wireless connection, including communication withdevices or computing devices disclosed herein. Memory can include one ormore non-volatile storage devices and/or one or more volatile storagedevices (e.g., random access memory (RAM)). In instances where theserver system includes a microprocessor, computer readable program codemay be stored in a computer readable medium, such as, but not limited todrive media (e.g., a hard disk or SSD), optical media (e.g., a DVD),memory devices, etc.

1 Introduction

The ability to predict outcomes is a key concept behind manytechnologies. The present invention teaches techniques, systems, andmethodologies for predicting outcomes, such as: a new non-linearcurve-fitting method that uses searches rather than calculations tobuild a polynomial that defines the best fit of a set of points to acurve, a new way to decompose a software source code such that theprocessing time of that code can be obtained, a method by which theexecution path of a software code can be known by examining the inputvariable values given to that code, etc.

The systems and methodologies 100 of the present invention can then beused, for example, to determine drone or missile intercept times andlocations, to automatically generate software timing and race conditiontests, to parallelize a general software code, and to automaticallygenerate various software analytics. These software analytics caninclude processing time, parallel processing speedup, parallelprocessing overhead, software power consumption, parallel processingcomputational accuracy, and the like.

2 Techniques

Referring to FIG. 1 , work for an algorithm is defined as how much timeit takes that algorithm to process a given dataset. The techniquesrequired for prediction purposes include decomposing a software unit(e.g., a software subroutine, module, or method) into a set of executionpathways 102, automatically generating polynomials given a set ofindependent values with their associated dependent variable values 104,and generating the time complexity function(s) of a software unit 106.The terms of each polynomial are found by searching a table of terms andapplying the new non-linear curve-fitting method. It should be notedthat in the table of terms, each row value of the adjacent column to theleft of the current column must be greater than or equal to the currentcolumn, which ensures that a unique term will be found on each search.

2.1 Software Unit Timing Prediction

For the purposes of time prediction, the independent execution pathwaysin a software unit need to first be identified. Each execution pathwayhas identifiable input variable attributes and both non-loop-control andloop-control conditional statements. Variable attributes consist of allaspects of the variable, including variable type (int, char, float,etc.), values (current value, minimum value, maximum value), group type(scalar, array (dimensions)), dimensions (1, 2, 3, . . . d), anddimension sizes (x, y, z).

2.1.1 Time Affecting Linear Pathways

Consider the general definition of an algorithm: any sequence ofoperations that can be simulated by a Turing-complete system. Analgorithm can contain multiple sequences of operations combined usingconditional statements (if, switch, else, conditional operator, etc.)and organized as software units. With the present invention, datatransformation results, timings and time predictions are associated witha particular pathway through the unit, implying that there can bemultiple such results associated with any unit. Since a unit can containmultiple sequences of operations, the processing time of the unit isdependent on which sequence is selected and, thus, is temporallyambiguous—herein known as Turing's first temporal ambiguity (TFTA).

Consider a McCabe linearly independent pathway, a LIP. McCabe's LIPconsists of linear sequences of operations, called code blocks,connected together using conditional statements with known decisions. ALIP is a simple algorithm within the body of the complex algorithm. Acode block within a LIP contains any non-conditional statement,including assignment statements, subroutine calls, or method calls, butnot conditional loops. A LIP treats each conditional loop as creating aseparate pathway so changes in processing time due to changes in loopiterations cannot be tracked for the end-to-end processing time of thesimple algorithm. Consider, however, that loops merely change the numberof iterations of linear blocks of code, not the code blocks themselves,as the algorithm processes data end-to-end.

Since it is desirable to track changes in processing time for theend-to-end processing of an algorithm, and since changes in processingtime are due to changes in the number of loop iterations (standard loopsor recursion), the concept of a time-affecting linear pathway (TALP)includes loops as part of that pathway. That is, unlike a LIP, a TALP'scode blocks can contain one or more loops. By allowing loops as part ofthe same pathway, it is possible to show how time can vary for theend-to-end linear processing of each pathway in each software unit of analgorithm. Calculating the timing changes from a TALP's input attributevalues on a per-TALP basis allows for the resolution of TFTA.

Loop structures may be constructed using one or more “for”, “do”,“while”, or “go to” statements, or from recursively called subroutines,functions, or methods. In programming there can also be hidden loops;for example, x^(y) can be thought of as Π_(i=1) ^(y)x, a loop of yiterations with an initial value of i=1 and an ending condition of i>y.If the y value is fixed then x^(y) (for example: x²) does not representa hidden loop. The single loop or nested loops within a loop structuremay contain two different types of conditional statements: loop controland non-loop control. Loop-control conditional statements are part of aloop's starting, ending, or iteration condition, so they are treated aspart of the loop structure itself, not as a true conditional statement.That is, loop-control conditional statements do not create additionalTALPs even if they are distributed within the loop. Non-loop-controlconditional statements are not part of a loop's starting, ending, oriteration condition and are treated the same as any other conditionalstatement. Meaning, each branch of the condition creates a separateTALP. Note that loops without input variable attributes, or anyassociated dependent variable attributes, that affect loop-controlconditions generate non-varying or static processing time, in the sameway that x^(y) with y fixed represents constant time.

Assignment statements are constants, variables, or arrays, linkedtogether using logical and/or mathematical operators and produce valuesfor variables or array dimensions and elements. These linked code blocksare appended to the code block that calls them, effectively substitutingthe contained code blocks for the subroutine, module and/or methodcalls. Note that code blocks that are not a part of a loop structurealso generate non-varying or static processing time.

Consider that a loop within a TALP can have input variable attributesthat affect that loop's number of iterations and thus the processingtime of the TALP. Further consider that the input variable attributeaffecting a loop's number of iterations could be an array-element valueand not just an array's element index value. Then the processing timecould appear random. This situation 108 is shown in FIG. 2 and is hereinreferred to as Turing's second temporal ambiguity (TSTA).

TALPs that exhibit TSTA 108, and whose loop indices are not modifiedwith the loop structure, will complete in variable polynomial time. Thismeans that although the TALP's processing will complete, the completiontime is not generally predictable, so creating a timing polynomial isinadvisable. Variable polynomial time should be flagged. If a TALP'stime-varying loop's index value is modified within the loop structureitself then it might or might not complete in polynomial time and shouldbe flagged as possibly Turing incomplete, meaning that the algorithmmight not finish processing, and thus, creating a timing polynomial isinadvisable. This is referred to herein as Turing's third temporalambiguity, TTTA.

All TALPs that do not exhibit either TSTA or TTTA will completeprocessing in a fixed polynomial time. This means that a singlepolynomial generated by mapping input-variable attribute values to theloop-control conditions of the TALP can be used to predict its variableprocessing time.

2.1.2 Automatic TALP Determination and Selection from Input VariableAttributes

Referring to FIGS. 3-4 , before processing time can be predicted, theTALPs and a method for selecting each TALP are identified. TALPdetermination requires mapping input-variable attribute values tonon-loop-control conditions, not loop-control conditions.Non-loop-control conditions are those control conditions associated withif, switch, else, control operators, and like statements. Since a TALPrepresents a group of code blocks connected via non-loop-controlconditional statements and all such statements test variable attributevalues, it is possible to map the input variable attribute values to aparticular TALP. As shown in FIG. 3 , there are two software units 110a, 110 b, each showing multiple pathways which will become TALPs.

All the input variable attributes of a software unit that are a part ofthe unit's non-loop-control conditional statements become members of thenon-loop-control conditional set C.

${{C\lbrack i\rbrack}\lbrack j\rbrack} = \begin{Bmatrix}{\left( a_{1,1} \right),\left( a_{1,2} \right),\ldots,\left( a_{1,j} \right),} \\{\left( a_{2,1} \right),\left( a_{2,2} \right),\ldots,\left( a_{2,j} \right),} \\{\ldots,} \\{\left( a_{i,1} \right),\left( a_{i,2} \right),\ldots,\left( a_{i,j} \right),}\end{Bmatrix}$

where a=the input variable attribute, i=the pathway index and j=theinput variable attribute index

As depicted in FIG. 4 , a TALP Selection Table (TST) 112 is generated bythe system 100 as follows:

-   -   1. All input variable attributes 114, or any associated        dependent variable attributes, associated with each pathway that        affect non-loop-control conditions are obtained from the set C.    -   2. The minimum and maximum values 116 a, 116 b of each input        variable attribute 114 within the non-loop-control conditions        are obtained via system 100 examination of the source code. If        no minimum or maximum value is found for an attribute, then the        minimum or maximum value of the data type of the attribute is        used.    -   3. The pathway index, attribute names, and attribute minimum and        maximum values are stored in the TST 112. Note that the pathway        index becomes the TALP index 118 in the TST 112.

Referring to FIG. 5 , the TALPs that are part of a software unit arecreated as follows:

-   -   1. The list of code blocks associated with each pathway, minus        the non-loop-control conditions, is extracted. Note that the        non-loop-control conditions are moved to the TALP Selection        Function shown below.    -   2. New TALPs are identified with the original software unit        names plus “TALP” plus the TALP index.    -   3. Each new TALP is filled with the extracted code blocks for        that TALP.

FIG. 5 shows an exemplary TALP creation 120—using the software unitdefined in and named TalpSelection1 (x1), the associated TALP is given.

Referring to FIG. 6 , a TALP Selection Function (TSF) 122 is createdusing the values found in the TST and the non-loop-control statementsfor each TALP. The TSF 122 is then substituted for the originalsource-code subroutine, module or method call to the software unit. Notethat the TSF 122 will be later modified for creating and executingparallel TALPs. A TSF 122 is required to select the correct TALP byusing minimum and maximum value data from the TST and the input-variableattribute values received. FIG. 6 shows an exemplary creation of a TSF122 using the TALPs created above.

2.1.2.1 TALP Attribute Domain and Range

Since a TALP represents a particular execution pathway through somealgorithm, and since only a particular subset of input variableattribute values can be used to select a TALP, then the subset of inputvariable attribute values used to select a TALP is its Attribute Domain(AD). A TALP's AD generates a set of output variable attribute valueswhich is the TALPs Attribute Range (AR).

TALPs can be linked together, called linked TALPs, if the precedingTALPs AR is a set or superset of the following TALP's AD. It should benoted that a TALP can contain a subroutine, method, or module (SMM)call. The list of TALP statements prior to the call is considered apseudo TALP ending point. The attribute values of the TALP at the pseudoend-point are considered the Pseudo Attribute Range, or PAR. The calledSMM is considered valid if the PAR matches at least one TALP within thecalled SMM. Since a valid called SMM only results in the activation ofone of its TALPs, it is possible that some of its TALPs are never calledwithin the algorithm. This condition, called a hanging SMM TALP, ispredictable by tracking all TALPs in all SMMs and determining which arenot selectable. If no TALP within an SMM is selectable then thecondition is called a hanging SMM.

2.1.2.2 Loops Containing TALPs

A TALP can contain loops and SMMs. If an SMM is contained within a loop,the TALPs within the SMM are also contained within a loop. This is thesame as the first statement of the TALP being a loop beginning and thelast statement being the loop ending. Therefore, this “outer loop”interacts with any loop within the SMM TALPs multiplicatively. An SMMwithin a loop control condition serves only to change the number ofloops performed. The loop count change depends on how the SMM interactswith the rest of the loop control conditions but does not cause the SMMto loop. Recursive SMM calls also cause a multiplicative interactionwith any loop within a TALP of the SMM.

2.1.3 Automated Processing Time Prediction Polynomial Generation

Referring to FIGS. 7-12B, time prediction typically associates some datavalue with time. This association frequently takes the form a curve fit.Curve-fitting can take a great deal of processing and might not convergeto a solution. The present invention makes it possible to generate amonotonic polynomial from a list of monotonic values, and theirassociated resultant monotonic values, using a binary search techniquerather than relying only on calculations.

Though this curve-fitting method can be used with a different set ofmonotonic values and their associated monotonic results, here a SourceValues Table 126 containing scaled input-variable attribute values andassociated scaled monotonic processing time values is compared to aTarget Values Table 128 containing sets of scaled attribute andassociated time values generated from some pre-existing functionsdepicted as the column headers, following the steps below.

-   -   1. A value for an input variable attribute a is divided        successively and executed by the system 100 to find the        associated processing time values t, creating the table 124 of        FIG. 7 .    -   2. As shown in FIG. 8 , the input attribute values a and        associated processing time values t are scaled by their        respective smallest received values, a_(min) and t_(min), and        saved in the Source Values Table 126. Note that if the smallest        a is already a one (1) then the t values are not scaled.    -   3. The time values t of the Source Values Table 126 are compared        to those found in the previously created Target Values Table        128, as shown in FIG. 9 .    -   4. The functions (polynomial terms) in the headers of the        columns of the Target Values Table 128 are in ascending order.        Any zero value in the Target Values Table 128 is not compared to        its corresponding Source Values Table 126 time value, but not        comparing a row does not eliminate the corresponding Target        table column function header from consideration for inclusion in        the final polynomial. When comparing the Source time values to        corresponding Target time values, all Source t values in a        column must be one of the following:        -   a. Greater than or equal to all associated Target values in            a column,        -   b. Less than or equal to all associated Target values in a            column, or        -   c. All Source t values are the same value.    -   The function header of any Target table column whose rows do not        meet condition a or condition b above is eliminated from        consideration for inclusion in the final polynomial, and a        comparison is made using a different target column. If condition        c is met, the value is considered a constant and added to the        Saved Term List f_(term). Condition c means the polynomial is        complete, and the process jumps to Step 8.    -   5. When Source time values are compared to the corresponding        Target time values, the closest column header that meets        condition a or b is saved in the f_(term) list and the process        continues with Step 6. If no tested columns meet condition a or        b then an error condition exists, and the “Error—stop        processing” message is displayed. This comparison is a binary        search process.    -   6. The selected Target column's values are subtracted from the        corresponding

Source time values, and those new values are saved in a temporary SourceValues Table. If the temporary Source time values contain any negativevalues, then the next found polynomial term is negative. The absolutevalues of the temporary Source time values are saved as the new SourceValues Table 130, as shown in FIG. 10 .

-   -   7. If there are any computed zero values in the new Source        Values Table 130, the values of the current column below the        zero are shifted to the row above, replacing the zero value.        Step 4 is then repeated at 132 using the new Source Values        Table, as shown in FIG. 11 .    -   8. All saved terms in the f_(term) list are summed, creating the        predictive, monotonic polynomial        (a) for input variable attribute a. To un-scale this polynomial        with its resulting scaled time t, it is multiplied by the        smallest original t value, called t_(min), within the original        Source Values Table.

Unscaled

(a)=t _(min)×Σ_(i=1) ^(n) f _(term) _(i)

-   -   Coefficients are automatically calculated from this step. Two or        more like terms are summed to produce the coefficient of the        term. For example, summing t² and t² gives 2t².    -   9. To test the predictive, monotonic polynomial's accuracy, it        is executed using the same values used to generate the original        Source Values Table. The polynomial-computed values are compared        to the actual values, giving the maximum percentage difference        as the maximum error, E_(max).

$E_{\max} = {\max\left( \left\{ {{\frac{❘{t_{1} - \left( a_{1} \right)}}{t_{1}} \times 100},{\frac{❘{t_{2} - \left( a_{2} \right)}}{t_{2}} \times 100},\ldots,{\frac{❘{t_{i} - \left( a_{n} \right)}}{t_{i}} \times 100},} \right\} \right)}$

Polynomial Generation Example

If the set of t values={1, 3, 13} and a={1, 2, 4} generated fromt=a²−a+1, the steps above are shown in the tables 134 of FIG. 12A. Notethat these tables 134 combine the Source and Target table values in amodified format table 136, as shown in FIG. 12B.

$\begin{matrix}{{{saved}{terms}} = {f_{term} = \left. \left\{ {a^{2},{- a},1.} \right\}\rightarrow{\sum\limits_{i = 1}^{3}f_{{term}_{i}}} \right.}} \\{{\therefore(a)} = {f_{term} = {a^{2} - a + {1{Q.E.F.}}}}} \\{E = {\left\{ {{\frac{❘{1 - 1}❘}{1} \times 100},{\frac{❘{3 - 3}❘}{3} \times 100},\ldots,{\frac{❘{13 - 13}❘}{13} \times 100}} \right\} = {\left. \left\{ {0,0,0} \right\}\rightarrow E_{\max} \right. = {{\max(E)} = {0\%}}}}}\end{matrix}$

2.2 Single Variable Monotonic Polynomial Inversion Solution

Referring to FIG. 13 and corresponding table 138, since the predictive,monotonic polynomial t=

(a) discussed in Section 2.1.3 above uses values of a, the inverse a=

⁻¹(t) only generates values of a. If the generated single-variable

(a) contains a single term, the inverse is simply the inverse functionof the detected term; for example, t=xa^(b) has the inversea=(t/x)^(1/b). Note that x here represents a coefficient. By adding asecond column header for the inverse of the found term, we can obtainthe inverse function of each term at the same time as we obtain thefunction for each term.

The larger the function term, the smaller its inverse, perhaps causingthe original smaller terms to dominate the potential inverse polynomial.For example, if

(a)=a³+a² then the inverse generated from the sum of the inversefunctions of each term would incorrectly give

⁻¹(t)=t^(1/3)+t^(1/2). The smaller term, the inverse of a², incorrectlydominates; thus, this is not the inverse of the original polynomial.

Consider that all variable-containing terms have the required a value sothat any variable-containing term could be used to solve for a. Sincethe inverse-polynomial problem discussed above is only a concern for thelower-order polynomial terms, the inverse of the highest-orderpolynomial term would be correct if it were the only term in thepolynomial. Because of the polynomial monotonicity, there can only be asingle solution. Referring again to table 138, given some t value, it ispossible to find the associated a value of the highest-order term if theeffects of any lower-order terms are removed.

The process for removing the effects of lower-order terms in finding theinverse differs depending on whether all polynomial terms are positiveor at least one lower-order term is negative.

2.2.1 Polynomial Inversion Solution When All Terms are Positive

Given a polynomial containing all positive terms, if the highest-orderthat term gives t=xa^(b) then its inverse gives a=(t/x)^(1/b). Givensome value t, the value a generated by the whole inverse polynomial isalways greater than or equal to the a value generated from thehighest-order term of the original polynomial. Removing the effects ofthe original lower-order terms to create the inverse polynomial can thusbe accomplished by subtracting values from the given t value until thehighest-order term, (t/x)^(1/b), is an integer value, assuming that acontains only integer values. This leads to the following method forfinding a=

⁻¹(t):

-   -   1. The inverse of the highest polynomial term is obtained.    -   2. The t value is divided by the coefficient of the original        term and the new value saved as temporary variable 1, v₁.    -   3. If temporary v₁ is not an integer, then one is subtracted        from the value of t and saved as the new t. Step 2 is repeated.    -   4. The value of v₁ is placed into the inverse function of the        highest polynomial term and a value calculated. If the        calculation fails, and t is greater than zero, then one is        subtracted from the value of t, saved as the new t, and Step 2        repeated. If the calculation fails and t equals zero, there is        an error and processing is stopped. If the calculation succeeds,        the newly calculated value is saved as the second temporary        variable, v₂.    -   5. If v₂ is not an integer, one is subtracted from the value of        t, the new y value saved, and Step 2 repeated.    -   6. The value c equals the value of integer v₂.

 If t =  

 (x) = 3x³ + 2x² + x + 1 and t = 35 then:  1.  

 ⁻¹(t) = (t/3)^(1/3)  2. v₁ = 35/3 = 11.67 - not an integer, subtractone from t.  3. v₁ = 34/3 = 11.33 - not an integer, subtract one from t. 4. v₁ = 33/3 = 11.00 - an integer.  5. v₂ = v₁ ^(1/3) = 2.224 - not aninteger, subtract one from t.  6. v₁ = 32/3 = 10.67 - not an integer,subtract one from t.  7. v₁ = 31/3 = 10.33 - not an integer, subtractone from y.  8. v₁ = 30/3 = 10.00 - an integer.  9. v₂ = v₁ ^(1/3) =2.154 - not an integer, subtract one from t.   10. v₁ = 29/3 = 9.57 -not an integer, subtract one from t. 11. v₁ = 28/3 = 9.33 - not aninteger, subtract one from t. 12. v₁ = 27/3 = 9.00 - an integer. 13. v₂= v₁ ^(1/3) = 2.080 - not an integer, subtract one from t. 14. v₁ = 26/3= 8.67 - not an integer, subtract one from t. 15. v₁ = 25/3 = 8.33 - notan integer, subtract one from t. 16. v₁ = 24/3 = 8.00 - an integer. 17.v₂ = v₁ ^(1/3) = 2.00 - an integer. 18. x = v₂.   ∴ x = 2, check t = 3 ×2³ + 2 × 2² + 2 + 1 = 35 Q.E.F.

2.2.2 Polynomial Inversion Solution When at Least One Term is Negative

When the

(a)-generated polynomial contains at least one negative term, and thevalue of t is also negative, then rather than subtracting values from tas discussed in Section 2.2.1, values are added to t to create theinverse polynomial

⁻¹(t).

Below is an example of generating an inverse when the originalpolynomial has at least one negative term and t is a negative value:

(a)<0

  If t =   

(a) = a³ − a² − a and t = −1 then: 1.   

⁻¹(t) = (t)^(1/3) 2. v₁ = −1/1 = −1- an integer, but < 0, add one to t3. v₁ = 1/1 = 1 - an integer, > 0 4. v₂ = v₁ ^(1/3) = 1 - an integer 5.a = v₂  ∴ a = 1, check 1³ − 1² − 1 = −1 Q.E.F.

Below is an example of a polynomial with at least one negative term butt is a positive value:

(a)≥0

  If t =   

(x) = 5a⁴ + 2a³ − 2a² − 1 and t = 440 then: 1.   

⁻¹(t) = (t/5)^(1/4) 2. v₁ = 440/5 = 88.0000 - an integer > 0 3. v₂ = v₁^(1/4) = 3.0628 - not an integer, subtract one from t. 4. Keepsubtracting until v₁ = 81 - an integer > 0 5. v₂ = v₁ ^(1/4) = 3.000 -an integer. 6. a = v₂  ∴ a = 3, check 5 × 3⁴ + 2 × 3³ − 2 × 3² − 1 = 440Q.E.F.

2.3 Piece-Wise Monotonic Polynomial Splines

The curve-fit shown above in Section 2.2 only works for monotonicallychanging input and output values. If the values do not changemonotonically then they must be decomposed into multiple monotonic setsof values. For example, ½ of a period for a Cos ( ) function may looklike the example 140 in FIG. 14 .

One half of a Cos( ) period can be decomposed into two monotonic curvesthat are joined at the inflexion point. Similarly, the whole period canbe decomposed into four monotonic curves joined by three inflexionpoints. To decompose the curve, all inflection points, that is, where anincreasing curve starts to decrease or a decreasing curve starts toincrease are first identified. Polynomial splines built betweeninflection points greatly decrease the computational order of eachindividual curve, avoiding Runge's phenomenon. The curves that increaseare expressed as positive monotonic polynomials and the curves thatdecrease are expressed as negative monotonic polynomials. The domains ofa domain limited monotonic polynomial is depicted as follows:

a_(TALP)[x][i]={v_(x,1), v_(x,2), . . . , v_(x,n)}

t_(TALP)=

_(i=start) ^(end)(a_(TALP)[x][i])

Where a_(TALP) [x][i]=the i^(th) value of the x^(th) input attribute,{v_(x,1), v_(x,2), . . . , v_(x,i)}=the set of all values, the inputattribute x, t_(TALP)=the value of the current polynomial of the currentTALP for input attribute x given the i^(th) value of the that attribute.

This generates the single attribute spline:

t _(TALP)=

_(i) ₁ _(=start) ₁ ^(end) ¹ (a _(TALP) [x][i ₁])∪

_(i) ₂ _(end) ₁ ^(end) ₊₁ ^(end) ² (a _(TALP) [x][i ₂])∪ . . . ∪

_(i) _(n) _(end) _(n−1) ^(end) ^(n) (a _(TALP) [x][i _(n)])

It should be noted that every polynomial,

( ), in the spline can be different.

3 Automatic Time Prediction Polynomial Generation for TALPs

As introduced in Section 2.1.1, there are several new and traditionalconcepts needed to perform TALP-execution time prediction. FIG. 15relates code to the terms used.

-   -   1. A TALP is a linear pathway through a group of code blocks        that includes loop structures as part of the same pathway.    -   2. An input variable attribute allows variable attribute values        to enter the TALP.    -   3. Workload w is the list of input variable attributes that are        used in loop-control conditions.    -   4. A loop-control condition can be a starting or ending        condition, or both, of a loop.    -   5. A loop is a coding mechanism that allows code blocks to        repeatedly execute, thereby varying the processing time.    -   6. An input variable attribute used in loop-control conditions        varies the number of loop iterations and therefore processing        time.    -   7. An L_(struct) is a group of hierarchical, connected loops.

The set of input variables, each with one or more attributes per TALP,is denoted symbolically as the set I_(unit) _(TALP) which can beshortened to I_(TALP) if the unit is known:

I_(TALP)={p_(1,1),p_(1,2), . . . , p_(1,a),p_(2,1),p_(2,2), . . .,p_(2,a), . . . ,p_(v,1),p_(v,2), . . . ,p_(v,a)}

where p=the input parameter for a TALP, v=the variable indicator, anda=the attribute indicator

Note that I_(TALP) includes all input variables, whether or not theyaffect loop-control conditions. The system 100 examination of the sourcecode identifies any input variable attributes or any associateddependent variable attributes used in a loop's control condition withina TALP which are then transferred to a subset of I_(TALP) called theworkload set w:

w={p_(1,1),p_(1,2), . . . ,p_(1,a),p_(2,1),p_(2,2), . . . ,p_(2,a), . .. ,p_(v,1),p_(v,2), . . . ,p_(v,a)}

Note that an individual element in the set w can be selected by exposingthe element indexes, that is:

w=w[v][a]={p_(1,1),p_(1,2), . . . ,p_(1,a),p_(2,1),p_(2,2), . . . ,p_(2,a), . . . ,p_(v,1),p_(v,2), . . . ,p_(v,a)}

where w[1][2]=p_(1,2).

Consider that time complexity is defined as the relationship betweeninput dataset size and processing time. As discussed above, analgorithm's input attribute values can affect the number of loopiterations and processing time. The processing time of an algorithm isalways a function of the pathway taken through that algorithm, itsexecuting TALP. This means that by using a set w per TALP instead ofinput dataset size per algorithm or even software unit, we can extendthe concept of time complexity to the values of any input variableattribute, or multiple input-variable attributes, related to processingtime, called Attribute Time Complexity (ATC). The ATC of an executionpathway includes both static and variable processing time. Static timeis further defined in Section 3.1. The variable-time predictionpolynomial,

_(TALP)(w), is defined to be a function that predicts the loop-varyingprocessing time given some set w per TALP. It is the predictivemonotonic polynomial

(a) of Section 2.1.3 but now specific to a TALP and the time-affectingattribute values in the set w.

Determining a variable-time prediction polynomial requires varying thevalues of the input variable attributes that affect time. Since theworkload w is the set of input variable attributes that affect theloop-control conditions of a TALP, if the attribute values in w aredivided into n pieces, w/n represented by w_(n), as for the creation ofthe Source Values Table of Section 2.1.3, we get:

$w_{n} = {\frac{w}{n} = {\frac{{w\lbrack v\rbrack}\lbrack a\rbrack}{n} = \left\{ {\frac{p_{1,1}}{n},\frac{p_{1,2}}{n},\ldots,\frac{p_{1,a}}{n},\frac{p_{2,1}}{n},\frac{p_{2,2}}{n},\ldots,\frac{p_{2,a}}{n},\ldots,\frac{p_{v,1}}{n},\frac{p_{v,2}}{n},\ldots,\frac{p_{v,a}}{n}} \right\}}}$

As discussed previously, a loop is a coding mechanism that allows codeblocks to repeatedly execute and, therefore, affect processing time. Aloop structure, L_(struct), consists of one or more loops. There canonly be one non-hierarchical loop per L_(struct). Two or more loops inan L_(struct) are hierarchically connected. Note that loops can iteratea constant or variable number of times and that w attributes are onlypresent in time-varying loops. A loop that does not contain an attributein the set w generates additional non-varying, static processing time.

3.1 Single TALP Attribute Processing Time Predictor

Once a TALP is selected, consider when its workload set w contains asingle time-affecting input variable attribute a. Following the processdescribed in Section 2.1.3, the present invention creates a SourceValues Table and compares it to a Target Values Table to generate thepredictive polynomial

_(TALP)(a) as well as the minimum unscaled attribute value a_(min) andthe minimum unscaled processing time t_(min). To use

_(TALP)(a), any new input attribute values for a must also be scaled bya_(min) and must be greater than or equal to a_(min). Using

_(TALP)(a) gives scaled time which must then be unscaled by multiplyingby t_(min).

${t_{v} \times {tu}} = {{\hslash_{TALP}\left( \frac{a}{a_{\min}} \right)} \times t_{\min} \times {tu}}$

-   -   where t_(v)=varying processing time and tu=time units        (microseconds, milliseconds, seconds, etc.)

As mentioned in Section 2.1.1, static time occurs when either a codeblock is not in a loop structure or when a loop structure's controlconditions are not affected by input variable attribute values. Thesystem 100 examination of the source code identifies these static loopstructures and code blocks. The total static processing time t_(s) isgenerated by executing and timing the static loops and code blocks.

t _(s) ×tu=(l _(s) +c _(s))×tu

-   -   where l_(s)=static loop structure processing time, c_(s)=static        code block processing time

Referring to FIG. 16 , the total time complexity function of a specificTALP given some input variable attribute a, denoted by T_(TALP)(a),includes both static and variable processing time. For some attribute a,using a minimum attribute size of a_(min), T_(TALP)(a) is shown below:

${T_{TALP}(a)} = {{\left( {l_{s} + c_{s} + {{\hslash_{TALP}\left( \frac{a}{a_{\min}} \right)} \times t_{\min}}} \right) \times {tu}} = {\left( {t_{s} + t_{v}} \right) \times {tu}}}$

UseCase1, One Attribute, One Loop Per Lstruct, One Lstruct, NoSignificant Static Time.

Examining useCase1 shows that there is only one TALP. The set w for theuseCase1 TALP is:

w={x1}

The tables 142 of FIG. 17 are created from a valid set of values for x1and the associated processing times for the useCase1 TALP and are usedto compare to the previously created Target Values Table to generate thetime complexity function T_(useCase1)(x1).

${{T_{{use}{Case}1}\left( {x1} \right)} \times {ms}} = {{0 + {{\hslash_{{use}{Case}1}\left( \frac{x1}{187500} \right)} \times 157 \times {ms}}} \approx {\frac{x1}{187500} \times 157 \times {ms}}}$

The detected error percentage is given by:

$E_{p} = \begin{Bmatrix}{{\frac{❘{{157{ms}} - {157{ms}}}}{157{ms}} \times 100},{\frac{❘{{313{ms}} - {314{ms}}}❘}{313{ms}} \times 100},} \\{{\frac{❘{{594{ms}} - {628{ms}}}}{594{ms}} \times 100},{\frac{❘{{1219{ms}} - {1256{ms}}}❘}{1219{ms}} \times 100},} \\{\frac{❘{{2484{ms}} - {2512{ms}}}❘}{2484{ms}} \times 100}\end{Bmatrix}$ $= \begin{Bmatrix}{{0\%},} & {{0.3\%},} & {{5.7\%},} & {{3\%},} & {1.1\%}\end{Bmatrix}$ ∴ E_(max)(E_(p)) = 5.7%

Given an acceptable error rate of 10%:

E _(max)(E _(p))=5.7%<10%→a good curve fit

3.2 Automatic Multiple TALP Attribute Processing Time Predictor

Multiple attribute TALP timing prediction differs from the singleattribute case in that the timing effect for each attribute must beseparately obtained then combined to give the variable processing time.In order to obtain separate timings for each attribute, only oneattribute's value is varied, keeping the other attribute values fixed,when creating each Source Values Table. Note that there is maximumnumber of pieces n, called n_(max), into which an attribute value can besplit and still be greater than or equal to the minimum the value usedto generate

_(TALP)(a_(x)), that is a_(min). With multiple attributes in the set w,it is necessary to first find n_(max) for for each attribute and thenuse the smallest as the maximum possible n when creating the SourceValues Tables. Because each generated variable-time predictionpolynomial represents only one attribute, these functions are calledpartial

_(TALP)(w) functions, denoted as ∂

_(TALP)(a_(i)) where a_(i) is a particular attribute.

Referring to FIG. 18 , how these partial functions are combined dependson the relationships of their associated attributes, denoted byR_(TALP)(w). Within the control condition of a loop in a particularL_(struct), examination of the source code by the system 100 shows whenand how different attributes are combined via some function, addition,subtraction, power, etc.

Referring to FIG. 19 , in addition, two or more L_(struct)s withdifferent attributes in their control conditions combine their effects,multiplicatively for hierarchical L_(struct)s and additively fornon-hierarchical L_(struct)s of the same hierarchical level.

UseCase2, Two Attributes, One Loop Per Lstruct, One Lstruct, NoSignificant Static Time.

Referring to FIG. 20 , this use case illustrates the creation of a timecomplexity function using multiple attributes, accomplished using thepartial time complexity functions found for each variable attribute in windependently.

UseCase2 above shows more than one input variable attribute that affectsprocessing time, that is:

w={x1, x2}

The timing results 144 of varying the value of x1 while fixing the valueof x2 to one are shown in the table of FIG. 21 .

A curve fit is performed using the value x1 of useCase2, giving thepartial variable-time prediction polynomial:

∂ use ⁢ Case ⁢ 2 ⁢ ( x ⁢ 1 ) = x ⁢ 1 187500 × 156

The results 146 of varying the values of x2 while fixing the value of x1to one are shown in the table of FIG. 22 .

A curve fit is performed using x2 in useCase2, giving the partialvariable-time prediction polynomial.

∂ use ⁢ Case ⁢ 2 ⁢ ( x ⁢ 2 ) = x ⁢ 2 187500 × 156

Examining the source code of useCase2, it can be seen that the loopwhose control condition contains both x1 and x2 adds the values of thetwo attributes, meaning that the loop will be repeated x1+x2 times. Notethat the relationship function for a loop with multiple attributes onlyapplies to the input variable attributes that change the number of loopiterations.

The relationship between the partial variable-time predictionpolynomials of useCase2 is:

R _(useCase2)(x1,x2)=∂

_(useCase2)(x1)+∂

_(useCase2)(x2)

Since T_(useCase2)(w) represents both static and variable time, for theuseCase2 TALP we get:

T use ⁢ Case ⁢ 2 ( w ) × ms = ( 0 + R use ⁢ Case ⁢ 2 ( x ⁢ 1 , x ⁢ 2 ) ) × ms= ( 0 + ∂ use ⁢ Case ⁢ 2 ⁢ ( x ⁢ 1 ) + ∂ use ⁢ Case ⁢ 2 ⁢ ( x ⁢ 2 ) ) × ms = ( (x ⁢ 1 187500 ) × 156 ) + ( ( x ⁢ 2 187500 ) × 156 ) × ms =   ( x ⁢ 1 + x ⁢ 2187500 ) × 156 × ms

4 Predictive Software Timing Tests

Typically, software test pattern recognition deals with spatial values:sizes, values, ranges, etc. Rarely are temporal patterns considered.This is true even though timing errors and race conditions remain themost difficult problems to address. There are two categories of timingtests: single algorithm and multi-algorithm. Single algorithm timingtests ensure that an algorithm or part of an algorithm (a subroutine,module, or method) completes within a certain amount of processing time.There are two types of multi-algorithm timing tests:total-completion-time tests and race-condition tests.Total-completion-time tests ensure that some set of algorithms completeprocessing within a certain time. Race-condition tests ensure that theaccess order to a common resource from multiple algorithms is correct.In order for a system to learn, predict, and isolate software executiontiming errors, there must be a way to both perform dataset instancetiming and generalize the instance timings into a predictive timingmodel this is accomplished using the techniques discussed above. Asshown in FIG. 23 , software unit pathways are determined at step 148,TALPs are generated at step 150, attribute TALP time complexity isdetermined at step 152, a list of all dependent variables per TALP areobtained at step 154, and dependent variable access order is determinedat step 156.

Below, in Sections 4.1 and 4.2, are the steps used to create bothpredictive software-unit-level timing and race-condition tests.

4.1 Predictive Software Unit Level Timing Tests

Creating a predictive timing test requires the following steps:

-   -   1. The software is separated into multiple software test units        (subroutines, modules, or methods) for testing.    -   2. The software units are separated into individual TALPs, and a        TALP Selection Table is created unit.    -   3. TALPs can be accessed using the associated per-TALP index        numbers.    -   4. For each TALP, the set of time-affecting attributes, w, is        identified and then the following is performed:        -   a. If there is a single attribute in w, the value is varied            and the            _(TALP)(a₁) function generated, after which any timing error            is determined by Step 3 below.        -   b. If there are multiple attributes in w then the ∂            _(TALP)(a_(i)) is generated for each attribute.        -   c. The system 100 examines the source code of the TALP and            generates the R_(TALP)(w).    -   5. For each TALP, the generated        _(TALP)(w) or R_(TALP)(w) function and the calculated t_(s) are        used to generate T_(TALP)(w).

Once all TALPs of the software unit have predictive time-complexityfunctions, they can be used to test as follows:

-   -   1. A set of processing time requirements is entered.    -   2. A dataset for a TALP with an associated predictive        time-complexity functions is entered, causing a time prediction        to be generated for the input dataset.    -   3. If the predicted time is greater than the maximum or less        than the minimum requirement then a predicted error has        occurred. Otherwise, there is no predicted error.

4.2 Predictive Race Condition Unit Level Tests

A race condition can only occur between at least two TALPs and aresource such as a block of RAM. If one TALP must read or write to theresource before another then it is possible for a race condition tooccur. Since a race condition is essentially a timing issue, it ispossible to determine which TALPs in which software unit use the commonresource and, thereby, determine the order of interaction. Creating apredictive race condition test requires the following steps:

-   -   1. Steps 1 through 5 above are used to create a predictive        timing test. However, rather than timing from the beginning of        the TALP to the end of the TALP, time is determined from the        beginning of a TALP to where a resource is accessed, called a        partial TALP. Read-access timings are kept separate from        write-access timings. To ensure accurate results, the timing        must be performed using a hardware timer.    -   2. Once the T_(TALP)(w) functions have been generated for all        read-write accesses of all TALPs of all software units, a set of        requirements dictating the access order and type, read or write,        of access is entered.    -   3. A dataset for each selected partial TALP is entered, causing        a time prediction to be generated for the input datasets.    -   4. The read-write access times are sorted and those resources        that are shared by more than one TALP are identified and        matched.    -   5. The order and type of access is compared to the requirements.    -   6. If the access order and type match the requirements, there is        no predicted error; otherwise, there is a predicted error.

5 Automatic Parallelization

Parallelization is the conversion of a software code such that it gainsprocessing speed by being able to use multiple processing elements(PEs). This is currently laborious, expensive, and considered to give,at best, linear results according to Amdahl's Law. Parallelizationrequires that the work of an algorithm be spread evenly across the PEs.Single PE algorithms use Big-O notation to define how processing timechanges with dataset size. For example, many image processing codes areO(n²), meaning that the processing time is the square of the inputdataset size. Big-O notation is an off-shoot of the concept of timecomplexity which calculates the processing time of an algorithm as afunction of input dataset size.

From time complexity and Big-O notation, decreasing the dataset size ofan algorithm with a non-linear processing order will give a non-lineardecrease in processing time. This means that decreasing the inputdataset size by spreading work across multiple PEs would make Amdahl'sLaw incompatible with Big-O unless the algorithm is O(n), that islinear. Examining algorithms shows that it is not just the dataset sizethat changes the processing time: as discussed in Section 2.1.1, anyinput-variable attribute value that affects the number of loopiterations performed by the algorithm will change the processing time.Redefining time complexity of an algorithm to be a function of the valueof input attribute values that affect loop iterations retains theoriginal definition (since dataset size is an input attribute value),while allowing scalar, vector, and multiple input attributes to be used.

Using this expanded time complexity definition, which ties analgorithm's input variable attribute values to the number of loopiterations, in parallel processing means that parallel performance canvary dynamically with the attribute values. As illustrated in FIG. 24 ,software unit pathways are determined at step 158, TALPs are generatedat step 160, attribute TALP time complexity is determined at step 162,dynamic discretization code for TALP is created at step 164,cross-communication for TALP is created at step 166, TALPparallelization occurs at step 168, and TALP metrics are created at step170, including speedup, overhead, power consumption, and accuracy.

5.1 Parallel TALP Time Complexity

Since n represents the number of pieces into which each attribute valuein set w is divided, or the number of PEs when one piece is executed perPE, and since w₁/n is represented by w_(n) as in Section 3, then n canbe represented by w₁/w_(n). As discussed in Section 3.2, n_(max) is themaximum number of pieces into which w can be split, and each piece stillbe greater than or equal to the minimum value w_(min) used to generateT_(TALP)(w), that is, w_(n) _(max) =w_(min).

${\frac{w_{1}}{w_{n}} = {\frac{w_{1}}{\left( \frac{w_{1}}{n} \right)} = n}},{\frac{w_{1}}{w_{n_{\max}}} = \frac{w_{1}}{w_{\min}}}$

Therefore:

${T_{TALP}\left( {w_{1},n} \right)} = {{\left( {l_{s} + c_{s} + {{\hslash_{TALP}\left( \frac{\left( \frac{w_{1}}{w_{\min}} \right)}{n} \right)} \times t_{\min}}} \right) \times {tu}} = {\left( {t_{s} + t_{v}} \right) \times {tu}}}$

When w₁ divided by w_(min) equals n, then the minimum possibleprocessing time occurs, a condition called Serialized Parallel,regardless of the values of w₁. The number of processing elementsrequired to create the Serialized Parallel condition is given by:

$n = \frac{w_{1}}{w_{\min}}$

This means n must always be less than or equal to w₁/w_(min).

5.2 Automatic TALP Run-time Dataset Decomposition and Scattering

Since algorithmic work is how much time it takes an algorithm to processa given dataset and since the processing time can vary with the numberof loop iterations, spreading algorithmic work evenly across multipleprocessing elements (PEs) requires replacing the TALP's original inputvariable attributes that affect variable time with the starting- andending-value versions of those same attribute.

If the TALP index i is added to the set w of indices from theintroduction of Section 3, we can describe the input attributes thataffect time as w[input variable] [input variable attribute][TALPindicator].

Symbolically we get:

${{{w\left\lbrack {{input}{variable}{index}} \right\rbrack}\left\lbrack {{input}{variable}{attribute}{index}} \right\rbrack}\lbrack{TALP}\rbrack} = {{{{w\lbrack v\rbrack}\lbrack a\rbrack}\lbrack i\rbrack} = \begin{Bmatrix}\begin{matrix}\begin{matrix}\left\{ {{p_{1,1,1},p_{1,2,1}},\ldots,p_{1,a,1},p_{2,1,1},p_{2,2,1},\ldots,} \right\} \\{\left. {p_{2,a,1},\ldots,p_{v,1,1},p_{v,2,1},\ldots,p_{v,a,1}} \right\},} \\\begin{matrix}\left\{ {{p_{1,1,2},p_{1,2,2}},\ldots,p_{1,a,2},p_{2,1,2},p_{2,2,2},\ldots,} \right\} \\{\left. {p_{2,a,2},\ldots,p_{v,1,2},p_{v,2,2},\ldots,p_{v,a,2}} \right\},}\end{matrix}\end{matrix} \\{\ldots,}\end{matrix} \\\begin{matrix}\left\{ {{p_{1,1,n},p_{1,2,i}},\ldots,p_{1,a,i},p_{2,1,1},p_{2,2,i},\ldots,} \right\} \\\left. {p_{2,a,i},\ldots,p_{v,1,i},p_{v,2,i},\ldots,p_{v,a,i}} \right\}\end{matrix}\end{Bmatrix}}$

Also from Section 3 above, n represents the number of pieces (as well asthe number of processing elements) into which an attribute value isdivided, as for p_(v,a)/n or the set of attribute values w/n or w_(n),to obtain process times to create a Source Values Table. As stated inSection 3.2, the maximum number of pieces n, into which aninput-variable attribute value can be split and still be greater than orequal to the minimum value used to generate

_(TALP)(a_(x)), that is a_(min) and is called n_(max). It is necessaryto first find n_(max) for each attribute in the set w and then use thesmallest as the maximum number of PEs that can be used for the set. Withw₁ representing any attribute value in the set w where n=1, and since ncan be represented by w₁/w_(n)=w₁/(w₁/n)=n, the system 100 of thepresent invention uses the following to find n_(max) when there aremultiple attributes in the set w:

${n\lbrack i\rbrack} = {\frac{{{w_{1}\lbrack v\rbrack}\lbrack a\rbrack}\lbrack i\rbrack}{{{w_{n}\lbrack v\rbrack}\lbrack a\rbrack}\lbrack i\rbrack} = \begin{Bmatrix}\left\{ {\left\{ {\frac{{{w_{1}\lbrack 1\rbrack}\lbrack 1\rbrack}\lbrack 1\rbrack}{{{w_{n}\lbrack 1\rbrack}\lbrack 1\rbrack}\lbrack 1\rbrack},\frac{{{w_{1}\lbrack 1\rbrack}\lbrack 2\rbrack}\lbrack 1\rbrack}{{{w_{n}\lbrack 1\rbrack}\lbrack 2\rbrack}\lbrack 1\rbrack},\ldots,\frac{{{w_{1}\lbrack 1\rbrack}\lbrack a\rbrack}\lbrack 1\rbrack}{{{w_{n}\lbrack 1\rbrack}\lbrack a\rbrack}\lbrack 1\rbrack}} \right\},\left\{ {\frac{{{w_{1}\lbrack 2\rbrack}\lbrack 1\rbrack}\lbrack 1\rbrack}{{{w_{n}\lbrack 2\rbrack}\lbrack 1\rbrack}\lbrack 1\rbrack},} \right.} \right. \\{\left. {\frac{{{w_{1}\lbrack 2\rbrack}\lbrack 2\rbrack}\lbrack 1\rbrack}{{{w_{n}\lbrack 2\rbrack}\lbrack 2\rbrack}\lbrack 1\rbrack},\ldots,\frac{{{w_{1}\lbrack 2\rbrack}\lbrack a\rbrack}\lbrack 1\rbrack}{{{w_{n}\lbrack 2\rbrack}\lbrack a\rbrack}\lbrack 1\rbrack}} \right\},\ldots,\left\{ {\frac{{{w_{1}\lbrack v\rbrack}\lbrack 1\rbrack}\lbrack 1\rbrack}{{{w_{n}\lbrack v\rbrack}\lbrack 1\rbrack}\lbrack 1\rbrack},\frac{{{w_{1}\lbrack v\rbrack}\lbrack 2\rbrack}\lbrack 1\rbrack}{{{w_{n}\lbrack v\rbrack}\lbrack 2\rbrack}\lbrack 1\rbrack},\ldots,} \right.} \\{\left. \left. \frac{{{w_{1}\lbrack v\rbrack}\lbrack a\rbrack}\lbrack 1\rbrack}{{{w_{n}\lbrack v\rbrack}\lbrack a\rbrack}\lbrack 1\rbrack} \right\} \right\},} \\\begin{matrix}\left\{ {\left\{ {\frac{{{w_{1}\lbrack 1\rbrack}\lbrack 1\rbrack}\lbrack 2\rbrack}{{{w_{n}\lbrack 1\rbrack}\lbrack 1\rbrack}\lbrack 2\rbrack},\frac{{{w_{1}\lbrack 1\rbrack}\lbrack 2\rbrack}\lbrack 2\rbrack}{{{w_{n}\lbrack 1\rbrack}\lbrack 2\rbrack}\lbrack 2\rbrack},\ldots,\frac{{{w_{1}\lbrack 1\rbrack}\lbrack a\rbrack}\lbrack 2\rbrack}{{{w_{n}\lbrack 1\rbrack}\lbrack a\rbrack}\lbrack 2\rbrack}} \right\},\left\{ {\frac{{{w_{1}\lbrack 2\rbrack}\lbrack 1\rbrack}\lbrack 2\rbrack}{{{w_{n}\lbrack 2\rbrack}\lbrack 1\rbrack}\lbrack 2\rbrack},} \right.} \right. \\{\left. {\frac{{{w_{1}\lbrack 2\rbrack}\lbrack 2\rbrack}\lbrack 2\rbrack}{{{w_{n}\lbrack 2\rbrack}\lbrack 2\rbrack}\lbrack 2\rbrack},\ldots,\frac{{{w_{1}\lbrack 2\rbrack}\lbrack a\rbrack}\lbrack 2\rbrack}{{{w_{n}\lbrack 2\rbrack}\lbrack a\rbrack}\lbrack 2\rbrack}} \right\},\ldots,\left\{ {\frac{{{w_{1}\lbrack v\rbrack}\lbrack 1\rbrack}\lbrack 2\rbrack}{{{w_{n}\lbrack v\rbrack}\lbrack 1\rbrack}\lbrack 2\rbrack},\frac{{{w_{1}\lbrack v\rbrack}\lbrack 2\rbrack}\lbrack 2\rbrack}{{{w_{n}\lbrack v\rbrack}\lbrack 2\rbrack}\lbrack 2\rbrack},\ldots,} \right.} \\{\left. \left. \frac{{{w_{1}\lbrack v\rbrack}\lbrack a\rbrack}\lbrack 2\rbrack}{{{w_{n}\lbrack v\rbrack}\lbrack a\rbrack}\lbrack 2\rbrack} \right\} \right\},}\end{matrix} \\\begin{matrix}\left\{ {\left\{ {\frac{{{w_{1}\lbrack 1\rbrack}\lbrack 1\rbrack}\lbrack i\rbrack}{{{w_{n}\lbrack 1\rbrack}\lbrack 1\rbrack}\lbrack i\rbrack},\frac{{{w_{1}\lbrack 1\rbrack}\lbrack 2\rbrack}\lbrack i\rbrack}{{{w_{n}\lbrack 1\rbrack}\lbrack 2\rbrack}\lbrack i\rbrack},\ldots,\frac{{{w_{1}\lbrack 1\rbrack}\lbrack a\rbrack}\lbrack i\rbrack}{{{w_{n}\lbrack 1\rbrack}\lbrack a\rbrack}\lbrack i\rbrack}} \right\},\left\{ {\frac{{{w_{1}\lbrack 2\rbrack}\lbrack 1\rbrack}\lbrack i\rbrack}{{{w_{n}\lbrack 2\rbrack}\lbrack 1\rbrack}\lbrack i\rbrack},} \right.} \right. \\{\left. {\frac{{{w_{1}\lbrack 2\rbrack}\lbrack 2\rbrack}\lbrack i\rbrack}{{{w_{n}\lbrack 2\rbrack}\lbrack 2\rbrack}\lbrack i\rbrack},\ldots,\frac{{{w_{1}\lbrack 2\rbrack}\lbrack a\rbrack}\lbrack i\rbrack}{{{w_{n}\lbrack 2\rbrack}\lbrack a\rbrack}\lbrack i\rbrack}} \right\},\ldots,\left\{ {\frac{{{w_{1}\lbrack v\rbrack}\lbrack 1\rbrack}\lbrack i\rbrack}{{{w_{n}\lbrack v\rbrack}\lbrack 1\rbrack}\lbrack i\rbrack},\frac{{{w_{1}\lbrack v\rbrack}\lbrack 2\rbrack}\lbrack i\rbrack}{{{w_{n}\lbrack v\rbrack}\lbrack 2\rbrack}\lbrack i\rbrack},\ldots,} \right.} \\\left. \left. \frac{{{w_{1}\lbrack v\rbrack}\lbrack a\rbrack}\lbrack i\rbrack}{{{w_{n}\lbrack v\rbrack}\lbrack a\rbrack}\lbrack i\rbrack} \right\} \right\}\end{matrix}\end{Bmatrix}}$

That is, for some particular TALP indicated by x, the maximum number ofPEs that can be used for a given input dataset is given by:

$n_{x,\max} = {{\min\left( {n\lbrack x\rbrack} \right)} = {\min\left( \frac{{{w_{1}\lbrack v\rbrack}\lbrack a\rbrack}\lbrack x\rbrack}{{{w_{n}\lbrack v\rbrack}\lbrack a\rbrack}\lbrack x\rbrack} \right)}}$

It is now possible to calculate the starting and ending values of eachvariable attribute of the set w for the TALP x to be processed by aparticular PE n using the following:

${{{start}\left( {{{{w\lbrack v\rbrack}\lbrack a\rbrack}\lbrack x\rbrack},n} \right)} = \left. {{\left( {n - 1} \right) \times \left( \frac{{{w\lbrack v\rbrack}\lbrack a\rbrack}\lbrack x\rbrack}{n_{x,\max}} \right)} + 1}\leftrightarrow{n > {0\bigwedge n} \leq n_{x,\max}} \right.},$${{end}\left( {{{{w\lbrack v\rbrack}\lbrack a\rbrack}\lbrack x\rbrack},n} \right)} = \left. {n \times \left( \frac{{{w\lbrack v\rbrack}\lbrack a\rbrack}\lbrack x\rbrack}{n_{x,\max}} \right)}\leftrightarrow{n \leq_{x,\max}} \right.$

Replacing the variable attributes found in the set w with theirequivalent starting and ending variable attribute values gives the newset ŵ:

${{{\hat{w}\lbrack v\rbrack}\lbrack a\rbrack}\lbrack i\rbrack} = \begin{Bmatrix}\begin{matrix}\begin{matrix}\left\{ {\left( {{{\left( {n - 1} \right) \times \left( \frac{p_{1,1,1}}{n_{1,\max}} \right)} + 1},{n \times \left( \frac{p_{1,1,1}}{n_{1,\max}} \right)}} \right),\ldots,} \right. \\{\left. \left( {{{\left( {n - 1} \right) \times \left( \frac{p_{v,a,1}}{n_{1,\max}} \right)} + 1},{n \times \left( \frac{p_{v,a,1}}{n_{1,\max}} \right)}} \right) \right\},} \\\begin{matrix}\left\{ {\left( {{{\left( {n - 1} \right) \times \left( \frac{p_{1,1,2}}{n_{2,\max}} \right)} + 1},{n \times \left( \frac{p_{1,1,2}}{n_{2,\max}} \right)}} \right),\ldots,} \right. \\{\left. \left( {{{\left( {n - 1} \right) \times \left( \frac{p_{v,a,2}}{n_{2,\max}} \right)} + 1},{n \times \left( \frac{p_{v,a,2}}{n_{2,\max}} \right)}} \right) \right\},}\end{matrix}\end{matrix} \\{\ldots,}\end{matrix} \\\begin{matrix}\left\{ {\left( {{{\left( {n - 1} \right) \times \left( \frac{p_{1,1,i}}{n_{i,\max}} \right)} + 1},{n \times \left( \frac{p_{1,1,i}}{n_{i,\max}} \right)}} \right),\ldots,} \right. \\\left. \left( {{{\left( {n - 1} \right) \times \left( \frac{p_{v,a,i}}{n_{i,\max}} \right)} + 1},{n \times \left( \frac{p_{v,a,i}}{n_{i,\max}} \right)}} \right) \right\}\end{matrix}\end{Bmatrix}$

The set ŵ is used to create a function called the parallel TALP orP_(TALP)(ŵ) function which executes the TALP on each of the n PEs:

executed PE TALP=P_(TALP)(ŵ[v][a][i])

Note that the input parameters of each TALP are modified to accept thestarting and ending values of each attribute in the set ŵ. The loopstructures of the TALP are also modified to incorporate the starting andending attribute values. An exemplary TALP modification 172 is shown inFIG. 25 , where A=the transformed input variable attribute that used inw, B=the end value of the input variable attribute used as theloop-ending condition and as an independent variable within a dependentvariable, and C=the start value of the input variable attribute used asthe loop's initial condition.

5.3 Automatic Run-time Output Dataset Agglomeration

Algorithms generate a set of output variable attribute values o[outputvariable index] [output variable attribute index] [TALP indicator]. Thisis depicted symbolically as:

${{{w\left\lbrack {{output}{variable}{index}} \right\rbrack}\left\lbrack {{output}{variable}{attribute}{index}} \right\rbrack}\lbrack{TALP}\rbrack} = {{{{o\left\lbrack v^{\prime} \right\rbrack}\left\lbrack a^{\prime} \right\rbrack}\lbrack i\rbrack} = \begin{Bmatrix}\begin{matrix}\begin{matrix}\left\{ {{p_{1,1,1},p_{1,2,1}},\ldots,p_{1,a,1},p_{2,1,1},p_{2,2,1},\ldots,} \right\} \\{\left. {p_{2,a^{\prime},1},\ldots,p_{v^{\prime},1,1},p_{v^{\prime},2,1},\ldots,p_{v^{\prime},a^{\prime},1}} \right\},} \\\begin{matrix}\left\{ {{p_{1,1,2},p_{1,2,2}},\ldots,p_{1,a^{\prime},2},p_{2,1,2},p_{2,2,2},\ldots,} \right\} \\{\left. {p_{2,a^{\prime},2},\ldots,p_{v^{\prime},1,2},p_{v^{\prime},2,2},\ldots,p_{v^{\prime},a^{\prime},2}} \right\},}\end{matrix}\end{matrix} \\{\ldots,}\end{matrix} \\\begin{matrix}\left\{ {{p_{1,1,i},p_{1,2,i}},\ldots,p_{1,a^{\prime},i},p_{2,1,1},p_{2,2,i},\ldots,} \right\} \\\left. {p_{2,a^{\prime},i},\ldots,p_{v^{\prime},1,i},p_{v^{\prime},2,i},\ldots,p_{v^{\prime},a^{\prime},i}} \right\}\end{matrix}\end{Bmatrix}}$

Since there is a relationship between some subset of the input variableattribute values and the output variable attribute positions, it ispossible to use the techniques used to predict time to predict thepositions of the output variable attributes. A position represents therelative location within an array of values. In order to predict therelationship between some subset of the input variable attributes andthe output variable attribute positions, a table of outputposition-predicting input variable attributes must be generated from thealgorithm's source code. This is accomplished by first listing all inputvariable attributes. Next, the output variable attributes consisting ofgreater than zero dimensions are listed. Then the input variableattributes and their dependent variable attributes are traced to thelisted output variable attributes. The initial output positionrelationship table is formed from the associated input variableattributes (along with its dependents) and the greater thanzero-dimensional output variable attributes. Since the method used tocreate the relationship between the input variable attributes and theoutput variable attribute position requires that both input and outputvariable attributes to be monotonic, splines may be used as for multipleattribute time prediction. Multiple attribute relationship polynomialsrelating the input variable attributes to the various output variableattributes that are greater than zero dimensions are generated and savedin the final output position relationship table.

Since the parallel processing method shown here requires the run-timedistribution of input dataset attributes (as shown in 5.2 above), theoutput dataset attributes need to be reassembled to obtain the finalanswer. The input variable attributes given to each processing elementare used along with the TALP's associated output position relationshiptable to put the output variable attribute values into their correctpositions.

5.4 Automatic Cross Communication Determination

Referring to FIGS. 26-32 , consider that cross communication impliesthat the processing of some dataset that has been spread across multiplePEs requires data to be shared by some or all of those PEs prior tocompleting the processing. There are three times when data can be sharedin the system 100: the TALP execution start, the TALP execution end, andsometime between the TALP's execution start and end.

A data-movement stencil 174 is the pattern accessed by random accessmemory (RAM) and used by some TALP. Although it is not obvious,data-movement stencils can also be used to determine which loopstructures require cross-communication as well as the type ofcross-communication that is required. For example, if there is adata-movement stencil whose size is greater than or equal to the arraysize and if the array elements are independent, then the work can beperformed on multiple PEs using all-to-all cross-communication 174 asince here all PEs share data with all other PEs, as shown in FIG. 26 .In this case, any element can be transmitted as long as it hasinteracted with all required array elements within the PE. This elementis transmitted to all other PEs where it is combined at the end with allrequired array elements within the receiving PE. Many of the standardcross-communication models are simply degenerative cases of theall-to-all exchange. Note that the start of an arrow becomes a “send”function in the TALP and the arrowhead becomes a “receive” function.

5.4.1 Single Dimension Exchange Detection

Left Cross-Communication Exchange: These exchanges only occur forone-dimensional arrays and can be detected using the pattern 174 b shownin FIG. 27 .

Right Cross-communication Exchange: These exchanges only occur forone-dimensional arrays, as shown with the pattern 174 c of FIG. 28 .

Left-Right Cross-Communication Exchange: These exchanges also only occurfor one-dimensional arrays, as shown with the pattern 174 d of FIG. 29 .

5.4.2 Two-Dimensional Exchange Detection

Checker-Board Exchange (Left-Right-Up-Down) Detection Pattern:Checker-Board exchanges can occur for two-dimensional arrays and higher.FIG. 30 shows this exchange pattern 174 e for a two-dimensional array.Higher dimensional arrays behave analogously.

Next-N-Neighbor Exchange Detection Pattern: The next-n-neighbor exchangecan occur for one-dimensional arrays, called a left-right exchange, orfor n-dimensional arrays between all adjacent elements in the same arrayfor all dimensions. FIG. 31 shows an example pattern 174 f for twodimensions; higher dimensional arrays behave analogously.

Transpose Exchange Detection Pattern: A transpose exchanges thedimensions of some array. A one-dimensional array has no transpose. Atwo-dimensional array exchanges rows for columns. A three-dimensionalarray can exchange rows for columns, rows for depths, or columns fordepths. Higher dimensional arrays behave analogously. FIG. 32 is anexample pattern 174 f of two-dimensional array transpose exchangedetection across multiple PEs.

5.5 Automatic Maximum TALP Speedup Prediction

Knowing how much faster an algorithm will process data using multiplePEs versus a single PE is an important metric. Speedup, the single PEtime divided by the maximum multi-PE time, t₁/t_(min), uses the timecomplexity calculation. Since n represents the number of PEs or thenumber of pieces into which each attribute value in set w is divided, ncan be represented by w₁/w_(n). Since n_(max) is the maximum number ofpieces into which w can be split and can be represented by w₁/w_(min)and since the processing time of w₁=t₁ and of w_(min)=t_(min),n_(max)=w₁/w_(min)→S(w₁/w_(min))=t₁/t_(min)→S(n_(max))=t₁/t_(min). Wecan now define the speedup of a TALP as:

${s_{TALP}\left( n_{\max} \right)} = {\frac{t_{1} \times {tu}}{t_{\min} \times {tu}} = {\left. \frac{\left( \frac{t_{1}}{t_{\min}} \right)}{\left( \frac{t_{\min}}{t_{\min}} \right)}\rightarrow\frac{T_{TALP}\left( \frac{w_{1}}{w_{\min}} \right)}{T_{TALP}\left( \frac{w_{\min}}{w_{\min}} \right)} \right. = \frac{\left( {t_{s} + {\hslash_{{TALP},v}\left( \frac{w_{1}}{w_{\min}} \right)}} \right)}{\left( {t_{s} + {\hslash_{{TALP},v}(1)}} \right)}}}$

The maximum speedup for a TALP with the set w containing multipleattribute values is handled analogously, using the multiple-elementversion of time complexity.

5.6 Automatic Parallel Processing Overhead Determination

There are two types of overhead: parallelization setup and crosscommunication. Parallelization-setup overhead determines how much slowerthe single-instance parallel TALP is than the original pathway throughan algorithm that is analogous to the TALP. This measures the setupprocessing-time cost incurred in creating and parallelizing a TALP.Cross-communication overhead determines how much slower a parallelizedversion of the TALP without cross communication is to the parallelizedversion of the same TALP with cross communication. This measures theprocessing-time cost incurred in cross communicating.

Since determining parallelization setup overhead requires knowing thesingle-instance value of the input variable attribute, we need to setthe number of PEs to one (1) in the parallel TALP time complexity.

${T_{{{TALP}\_ p}{\_{single}}{\_{intance}}}\left( {w_{1},{n = 1}} \right)} = {\left( {l_{s} + c_{s} + {{\hslash_{TALP}\left( \frac{\left( \frac{w_{1}}{w_{\min}} \right)}{1} \right)} \times t_{\min}}} \right) \times {tu}}$

If a time complexity for the original pathway which will become theTALP, T_(pathway)(w₁), is generated then, since it is always executedusing a single PE, the parallel processing overhead can be defined asT_(pathway)(w₁) divided by T_(TALP,p_single_instance)(w₁). Thepercentage of processing overhead from parallelization can now be givenas:

${O_{{TALP}\_{parallelization}}\left( {w_{1},{n = 1}} \right)} = \left( {1 - {\frac{T_{pathway}\left( w_{1} \right)}{T_{{TALP},{{p\_{single}}{\_{intance}}}}\left( {w_{1},{n = 1}} \right)} \times 100}} \right.$

If a time complexity is generated for a TALP prior to the insertion ofthe send and receive functions required for cross-communication,T_(TALP_no_comm)(w₁, n), and after send and receive functions areinserted, T_(TALP_comm)(w₁, PE), then cross-communication overhead canbe defined as T_(TALP_comm)(w₁, n) divided by T_(TALP_no_comm)(w₁, n).The percentage of processing overhead from cross-communication can nowbe given as:

${O_{{TALP}\_{crossCommunication}}\left( {w_{1},n} \right)} = {\left( {1 - \frac{T_{{TALP}\_{comm}}\left( {w_{1},n} \right)}{T_{{{TALP}\_{no}}{\_{comm}}}\left( {w_{1},n} \right)}} \right) \times 100}$

The total parallel overhead is the parallelization overhead plus thecross-communication overhead:

O _(TALP)(w ₁ , n)=O _(TALP_parallelization)(w ₁ , n)+O_(TALP_crossCommunication)(w ₁ , n)

5.7 Automatic TALP Parallel Processing Power Consumption Determination

Understanding the on-going power consumption of a TALP requires knowingthe processing time and the energy cost of all PEs used by the TALP. Thepower consumption calculation is the processing time of a TALPmultiplied by the number of PEs used to obtain that processing timemultiplied by the number of watts.

P _(TALP,p)(w ₁ ,n)=T _(TALP,p)(w ₁ ,n)×tu×watts

Because watts are joules per second, the time units must be converted toseconds to match.

P _(TALP,p)(w ₁ ,n)=T _(TALP,p)(w ₁ ,n)×n_(max)×converter×seconds×joules/seconds

where converter=the coefficient that converts tu into seconds

5.8 Automatic TALP Parallel Processing Accuracy

TALPs contain both dependent and independent variables. In the sourcecode of computer languages like C, dependent variables are always to theleft of an equal sign while independent variables are always to theright. Referring to FIG. 33 , the set of dependent variables, d, alongwith their final values, can be created by executing the TALP andstoring all dependent variable values in a table called the DependentVariable Table 176, DVT_(TALP).

If a DVT is also created for an execution pathway before it isidentified as a TALP, then the sets of dependent variables from thepathway and the TALP are compared, and any error between them can becalculated. Given dependent-variable ending values from a TALP labeled

_(i) and from the pathway

_(i), and given that

_(i) and

_(i) represent analogous dependent variables, then the maximum error is:

DVT maxError = max ⁡ ( { 1 - 1 1 × 100 , ❘ "\[LeftBracketingBar]" 2 - 2 ❘"\[RightBracketingBar]" 2 × 100 , … , ❘ "\[LeftBracketingBar]" i - i ❘"\[RightBracketingBar]" i × 100 , } )

6 Using TALPs in Quantum Computing

Referring to the diagram 177 of FIG. 34 , TALPs can be utilized inquantum computing applications as well. In certain embodiments, theprocess includes the original source code 177 a, which is fed to a TALPgenerator 177 b. Also included is a parallel code generator 177 c and areversible polynomial generator 177 d, both of which receive informationfrom the TALP generator 177 b. Further, the reversible polynomialgenerator 177 d receives monotonic attributes 177 e. The results fromthe reversible polynomial generator 177 d are fed to a quantum circuitgenerator 177 f, with the parallel code generator 177 c and the quantumcircuit generator 177 f feeding to the parallel computer system 177 g,which is operatively integrated with and/or communicating with thequantum computer system 177 h.

Any function can be processed on a quantum computer. However, to realizethe advantage of quantum computing over classical computing requires thefunction to be reversible and, thus, able to form reversible logic gateswhich are zero entropic. Reversibility is the same requirement needed tocreate an inverse time prediction polynomial. Dr. Richard Feynman, whogave much of the theoretical underpinning for quantum computing, notedthat any algorithm could be created using only reversible functions andthat a quantum gate version of any algorithm could be created fromreversible functions. Quantum gate versions of algorithms perform betterthan classical algorithms only in the case where the algorithm couldtake advantage of quantum superposition and/or quantum entanglement,called inherently quantum algorithms.

Feynman's ideas were used to support the rewriting of algorithms intoreversible function form. The system 100 of the current inventionautomatically extracts the reversible function form from source code.

As previously shown in this disclosure, any set of monotonic inputattributes associated with a set of monotonic output attributes, calledthe monotonic condition, can be used to generate predictive polynomialsand as long as the monotonic condition is met, an inverse polynomial canbe created. It has also been shown here that it is possible to takenon-monotonic but continuous attribute values and convert those valuesinto a set of monotonic splines. This means that a reversible functioncan be generated automatically using the methods of the currentinvention.

Meeting the monotonic condition also means that Runge's Phenomenon forhigher-order polynomials is not in force, so under this condition higherorder polynomials are also reversible. Monotonicity in a TALP that isnot inherently monotonic can be achieved by deconstructing the TALP intoTALP splines which are each monotonic. Since TALPs or TALP splines withpredictive polynomials and inverse predictive polynomials arereversible, they are zero entropic and can be used to form quantum logicgates.

Given a monotonic condition, it is possible to use the techniques taughtherein to also predict the output variable values. In order to predictthe relationship between some subset of the input variable attributesand the output variable values, a table of output-value-predicting inputvariable attributes must be generated from the algorithm's source code.All input variable attributes and their associated output variableattributes are first found and listed by the system 100, creating theinitial output values relationship table Since the method used to createthe relationship between the input variable attributes and the outputvariable values requires the monotonic condition, splines may be used.Multiple attribute relationship polynomials relating the input variableattributes to the various output variable values are generated and savedin the final output values relationship table. Since the generatedpolynomials are reversible, using them instead of the original sourcecode ensures that a reversible form of the algorithm is used and, thus,can be executed using quantum gates.

It is possible to reproduce the functionality of an algorithm with a setof zero entropy predictive polynomials, a process called TALPextraction. TALP extraction itself is not reversible since there mightbe many possible source code implementations that yield the same set ofTALP extractions.

As Richard Feynman noted, there are engineering advantages to usingmultiple linked reversible functions forming a larger reversiblefunction in quantum computing. The present disclosure has alreadydetailed how to link together TALPs.

If the multiple attribute time prediction polynomial of a TALPextraction has w₁/w_(min)=n, where w_(min) is the set of actual minimumattribute values possible for the TALP, then that TALP extraction iscalled the minimum TALP Quantum Dataset (mTQD), giving an algorithm thatrequires the least amount of processing time and energy.

Algorithms that generate the same set of TALP extractions executing inthe same order are equivalent, making it possible to determine if twocodes are the same even if code obfuscation techniques are used.

For an mTQD, in the absence of superposition or entanglement, theperformance of a parallelized mTQD implementation and quantum circuitmTQD implementation is a function of the parallelized t_(min) and thequantum circuit t_(min) values, which for well-formed systems would beapproximately the same. If a mTQD contains polynomials, with at leastone term that can take advantage of either superposition orentanglement, then that mTQD will have a performance advantage whenimplemented using a quantum circuit instead of using parallelprocessing. The creation of a mTQD from a set of monotonic attributevalues where no source code is available is called minimum TALPinference.

Like parallel processing, the TALPs that are in the form of reversiblefunctions are distributed to multiple compute elements and the outputvariable positions are computed in the same way.

7 Non-Linear Frameworks used to Treat Non-Linear Algorithms Linearly

The advantage of using monotonic versions of algorithms to transform thealgorithm into reversible form has already been shown in both parallelprocessing and quantum computing. Another advantage is the ability touse linear techniques on non-linear algorithms, called pseudo-linearity.An example of pseudo-linearity is shown for a projectile (e.g., drones,missiles, etc.) intercept determination. It should be noted that, aswith the algorithmic forms shown in this disclosure that a reversiblealgorithm has been created, meaning that the example represents anon-linear intercept algorithm that can be processed using eitherparallel processing or quantum computing. This is generally true withall pseudo-linear algorithmic forms.

7.1 Novel Automatic Projectile Missile/Drone Intercept Determination

Generating predicted intercept points, PIPs, can require hundreds ofthousands of calculations per PIP, limiting the number of real-time PIPsthat can be calculated by a system. If the hardware of a system cannotbe changed to meet the evolving need to create hundreds of simultaneousPIPs in real-time then the number of calculations per PIP must besignificantly decreased. Using the techniques detailed hereinabove, thepresent invention will greatly decrease the processing time required todetermine if one or more drones are going to collide, or alternativelydetermine the optimum predicted intercept point of a missile. Referringto FIG. 35 , to create a PIP with these techniques, first acurve-fitting polynomial is generated for each coordinate of a detectedtrack at step 178, using its position values and associated positiondetection times, and then an inverse polynomial is generated for eachpolynomial coordinate at step 180. The reciprocal of the polynomial ofeach coordinate is next created at step 182, followed by the creation ofan intercept at step 184.

7.1.1 Non-Linear Polynomials Behaving Linearly Within a Framework

Typically, curves are graphed in either Cartesian, polar, spherical,cylindrical, or some other system with fixed coordinates, to allow forapples-to-apples comparisons between curves. However, a monotonicsection of a polynomial can be represented as the diagonal, a line, fromthe points of the curve generated by that section on sometwo-dimensional graph where the values of the axes represent the rangeand domain of that monotonic polynomial section, as shown with the graph186 of FIG. 36 . The symbol for a monotonic polynomial section is

(c).

Referring to graph 188 of FIG. 37 , the reciprocal of a polynomial thatis behaving linearly within some framework also behaves linearly withinthat same framework. The symbol for the reciprocal of a monotonicpolynomial is

(c).

Referring to graph 190 of FIG. 38 , the following possiblerelationships—overlapping, parallel, and intersecting—can exist betweenpolynomials that behave linearly within a framework.

7.1.2 Using Linear Tools with Non-Linear, Single Variable PolynomialsWithin a Framework

The following equations represent the tools used by multiple,interacting monotonic polynomials behaving linearly in the sameframework:

-   -   1. Reciprocal of a polynomial that behaves linearly within a        framework:

$(c) = {\frac{1}{(c)}.}$

-   -   2. Intersection of two polynomials that behave linearly within        the same framework:        (c)=        (c).    -   3. Shifting a polynomial that behaves linearly within a        framework up or down by some value i:        _(shift up or down)(c)=        (c)±i.    -   4. Shifting a polynomial that behaves linearly within a        framework left or right by some value i:        _(shift left or right)(c)=        (c±i).    -   5. Because the Target Values Table columns as first discussed in        Section 2.1.3 share at most one row value that is the same and        because the rows in a column are monotonic, then the minimum        number of rows required to detect a column is two. That is, only        two telemetry points are required to find the terms of a        polynomial.

7.1.3 Predicted Intercept Position Using Polynomials

Existing sensors are capable of identifying a track's position in x, y,and z at some point in time t. For any track, the x, y, and z coordinatevalues are always related by the same time value. This means that it ispossible to perform a separate analysis on each coordinate and relatethem all to the common time, creating the x, y, and z interception pointwhich is the optimum PIP. To predict the optimum point of interception,a coordinate-in-time prediction polynomial for each coordinate x, y, andz is created. A polynomial that is perpendicular to any of thecoordinate-in-time prediction polynomial curves, from some “Own ship”whose analogous coordinate is not on the curve, is next created. Thepoint of interception between the coordinate-in-time polynomial curveand the perpendicular polynomial curve represents the optimuminterception point because it is the shortest interception distance.

There are two types of PIPs processed by this system 100. Type 1 is thepoint of intersection between the predicted coordinate-in-timepolynomial curve and the perpendicular from an Own ship position not onthe predicted curve. Type 2 is a point on the predicted curve that isnot the position of an Own ship when it is on the predicted track curve.The existence of a Type 2 PIP means that the tracked launch vehicle ispredicted to collide with the Own ship.

To determine which type of PIP calculations are required, the presentsystem 100 performs the following steps.

-   -   1. First, the track coordinates are separated into individual        x-time, y-time, and z-time coordinate value tables, the Source        Value Tables of Section 1 hereinabove.    -   2. The time and coordinate values in each coordinate value table        are scaled by the smallest time and smallest coordinate values,        respectively.    -   3. A monotonic coordinate-to-time prediction polynomial is        generated for each coordinate value table by comparing each to        the Target Values Table.    -   4. A coordinate is selected, and the reciprocal monotonic        coordinate-to-time prediction polynomial is generated and        shifted to the analogous Own ship's coordinate, generating the        monotonic perpendicular polynomial.    -   5. The interception point is the point where the monotonic        coordinate-to-time prediction polynomial and the monotonic        perpendicular polynomial values are equal.    -   6. From the interception point and the monotonic        coordinate-to-time prediction polynomial, the interception time        is calculated.    -   7. Using the inverse of the other two coordinate-to-time        polynomials and the interception time, the corresponding values        of the other two coordinates are calculated, together giving the        complete interception point.    -   8. The distance from the complete interception point to the Own        ship position is calculated.

If the calculated distance is outside of the maximum error value rangeof the monotonic coordinate-to-time prediction polynomial, then a Type 1PIP is calculated by unscaling the time and each coordinate value. Thetime and value of each coordinate is multiplied by its respectivesmallest unscaled value to give the real-time optimal Type I PIP.

If the calculated distance is within the maximum error value range ofthe monotonic coordinate-to-time prediction polynomial, then a Type 2PIP is calculated. In a Type 2 PIP, an intercept can take place on anycoordinate position that is not the Own ship's coordinate position aslong as it occurs before the Own ship's position is reached. The furtheraway that the intercept occurs, the better, as long as the probabilityof an intercept is high enough. Given the interceptor data with theassociated probability of intercept as a function of distance, if thepresent system 100 receives an acceptable probability of intercept, thensubtracting the furthest distance that has the acceptable probabilityfrom the Own ship's position gives the optimum intercept position. Tounscale, the time and value of each coordinate is multiplied by eachrespective smallest unscaled value to give the real-time optimal Type 2PIP.

Assumptions for the PIP-Creation Steps Based on the Concepts

Separating the coordinates simplifies and reduces the number ofpolynomial-generation calculations.

Scaling the values of a polynomial does not change the nature of thepolynomial. Being able to scale the input values decreases the number ofTarget Values Table rows that are required for comparison to areasonable number, typically less than one hundred, for example.

Because the Target Values Table is ordered, a binary search can beperformed.

The shortest distance between a line in some framework and a point noton the line in the same framework is a line perpendicular that line andthe point. The reciprocal of the original line is a perpendicular tothat line. This perpendicular can be shifted by adding to the inputvalue of the perpendicular. Thus, any point along the c-axis can haveits perpendicular calculated.

The intersection of the perpendicular polynomial and the polynomial isthe point where the computed polynomial time equals the computedperpendicular polynomial time and represents an intercept point. Sincethe optimum PIP is the point on the polynomial curve that is theshortest distance to the Own ship position, and since the perpendicularintersection is the point of shortest distance, then this calculationcreates the optimum Type 1 PIP.

The shared point between the original and perpendicular polynomials isused in the original polynomial to give the optimum PIP intercept time.

If there are multiple monotonic coordinates whose behavior is linked byone of the axes, such as time, but are otherwise independent, then it ispossible to solve for one of the coordinates and, using the inversepolynomial and the shared axes' value, find the other coordinate values.Since the polynomials generated using the above method are alwaysmonotonic in both their ranges and domains, they are invertible. Sinceeach coordinate shares the same processing time, finding the PIP of onecoordinate allows the found PIP's intercept time to be used to find theother coordinate values. This is accomplished by using the inverse ofthe polynomials for the other coordinates with the found PIP's intercepttime used as input.

Referring to graph 192 of FIG. 39 , since the input values used togenerate the polynomials of each coordinate were scaled, the finalvalues must be unscaled. To unscale the coordinate values, thecalculated intercept coordinate values are multiplied by the minimumvalue of the original coordinate input value used to create thepolynomial of that coordinate. To unscale the intercept time, thecalculated intercept time value is multiplied by the original inputminimum time value.

Compared to the hundreds of thousands of calculations required byconventional methods, this method is computationally inexpensive.Because only two data points need to be detected, the proposedsolution's calculations can begin earlier than existing methods. Thus,the proposed solution of the present invention offers the opportunity togreatly increase the number of real-time PIPs generated per processingelement without sacrificing existing capabilities.

It should be noted that any continuous, function can be decomposed intoa series of monotonic functions separated by range. This increases theusefulness of this technique.

7.1.4 Decluttering

The following represent clutter tracks. A target track has aninterceptor launch scheduled while a clutter track does not. Tracks thatwould normally be considered target tracks can be treated as cluttertracks if one of the following conditions occurs:

-   -   1. If there is an acceptable Identification, Friend, or Foe        (IFF) signal associated with the track,    -   2. If the track is within a range, altitude, sector, or area        gate,    -   3. If the Own ship lies along the track but the track velocity        equals the Own ship velocity,    -   4. If there is a Type I optimum PIP for the track which is the        furthest position used to create the predicted        coordinate-in-time polynomial curve.

7.1.5 Interceptor Launch Scheduling

Referring to graph 194 of FIG. 40 , once the x, y, z position of theoptimum PIP is found, I(x, y, z), the distance between the Own ship's x,y, z position, O(x, y, z), and the PIP position can be calculated as theabsolute value of the difference between I(x, y, z) and O(x, y, z).

To determine the launch time, first an associated interceptor's averagevelocity, I_(v) is multiplied by the distance, d, giving the flighttime, F_(t). Next, the flight time is subtracted from the optimumintercept time, I_(t) giving the interceptor-scheduled launch time,S_(t).

d=|I(x, y, z)−O(x, y, z)|,

F _(t) =d×I _(v),

S _(t) =I _(t) −F _(t)

Where d=the distance between intercept and the Own ship, I(x, y, z)=theposition of optimum intercept, O(x, y, z)=the position of the Own ship,F_(t)=the interceptor flight time, I_(v)=the interceptor averagevelocity, S_(t)=the scheduled launch time, and I_(t)=the optimumintercept time.

8 Conclusion

While various embodiments have been described above, it should beunderstood that they have been presented by way of example only, and notlimitation. Thus, the breadth and scope of the present disclosure shouldnot be limited by any of the above-described embodiments or examples.Moreover, any combination of the above-described elements in allpossible variations thereof is encompassed by the disclosure unlessotherwise indicated herein or otherwise clearly contradicted by context.

References to methods and steps such as inputting, processing, entering,and the like can include manual user inputs, or direct generation andinsertion/inclusion of data via the software of the present system 100.

Additionally, while the methods described above and illustrated in thedrawings may be shown as a sequence of steps or processes, this was donesolely for the sake of illustration. Accordingly, it is contemplatedthat some steps may be added, some steps may be omitted, the order ofsteps may be re-arranged, and some steps may be performed in parallel.

It will be readily apparent to those of ordinary skill in the art thatmany modifications and equivalent arrangements and methodologies can bemade thereof without departing from the spirit and scope of the presentdisclosure, such scope to be accorded the broadest interpretation of theappended claims so as to encompass all equivalent structures andproducts.

For purposes of interpreting the claims for the present invention, it isexpressly intended that the provisions of Section 112, sixth paragraphof 35 U.S.C. are not to be invoked unless the specific terms “means for”or “step for” are recited in a claim.

What is claimed is:
 1. A method of generating one or more time-affectinglinear pathways (TALPs), comprising: creating a source values table anda target values table for each input dataset attribute that affectsprocessing time of one or more multiple attribute TALPs by repeatedlyselecting and varying a different input dataset attribute value whileholding unselected input dataset attribute values constant; comparingone or more scaled monotonic processing time values of the source valuestable to associated time values of the target values table; creating oneor more final polynomials based on the comparison; determining arelationship between one or more input variable attributes values thataffect the processing time of the one or more multiple attribute TALPsby examining respective loop structure relationships; and combining theone or more final polynomials, from each of the one or more inputvariable attribute values that affect the processing time of the one ormore multiple attribute TALPs, into a single polynomial using thedetermined relationships between all input variable attribute valuesthat affect the processing time of the one or more multiple attributeTALPs.
 2. The method of claim 1, further comprising generating amonotonic time complexity polynomial inversion solution.
 3. The methodof claim 2, wherein generating the monotonic time complexity polynomialinversion solution comprises: inverting the monotonic time complexitypolynomial when all terms are positive; or inverting the monotonic timecomplexity polynomial when at least one term is negative.
 4. The methodof claim 1, further comprising generating a total completion timesoftware timing test, including: selecting one or more TALPs to beexecuted given a set of input variable attribute values; obtaining anallowed processing time for software; calculating a predictiveprocessing time of at least one TALP given the set of input variableattribute values; comparing the calculated predictive processing timeagainst the allowed processing time; and determining timing test aspassed if the calculated predictive processing time is less than orequal to the allowed processing time, or determining timing test asfailed if the calculated predictive processing time is greater than theallowed processing time.
 5. The method of claim 1, further comprisinggenerating a predictive race condition test, including: generating alist of shared resources; determining which TALPs access the sharedresources; determining a starting time for each TALP accessing theshared resources; calculating a predicted processing time for each TALPthat shares a resource; determining overlapped shared resource accessfrom two or more TALPs; and determining that a predictive race conditiontest is passed if only one TALP accesses the shared resource at a time,and determining the predictive race condition test is failed if morethan one TALP accesses the shared resource at the same time.
 6. Themethod of claim 1, further comprising indicating a TALP to be selectedby comparing minimum and maximum values of non-loop-control conditionalattributes of a set of TALPs with a current set of inputnon-loop-control conditional attribute values.
 7. The method of claim 6,further comprising: creating a table of single or multiple attributeTALPs; creating a set of associated non-loop-control conditional inputvariable attribute minimum values and input variable attribute maximumvalues for each created TALP; and selecting a single or multipleattribute TALP based on a set of input variable attribute values and thecreated table of single or multiple attribute TALPs with associatedinput variable attribute minimum values and associated input variableattribute maximum values.
 8. The method of claim 1, further comprisingautomatically determining an attribute domain for an individual TALP. 9.The method of claim 8, further comprising: determining input variableattributes that contribute to output variable attribute values of theindividual TALP; determining minimum and maximum input variableattribute values for the individual TALP along with associated minimumand maximum output variable attribute values; and combining minimuminput variable attribute values, minimum output variable attributevalues, maximum input variable attribute values, and maximum outputvariable attribute values for each individual TALP into an attributedomain and range table.
 10. A method of determining a quantum code fromone or more multiple attribute time-affecting linear pathway (TALP)parallel components, comprising: receiving the one or more multipleattribute TALP parallel components; deconstructing the one or moremultiple attribute TALP parallel components into a plurality of singleor multiple attribute TALP splines; determining one or more inputdataset attribute values for the one or more multiple attribute TALPparallel components that vary output dataset attribute values of the oneor more multiple attribute TALP parallel components; splitting the oneor more input dataset attribute values into a plurality of monotonicinput dataset lists that generate a plurality of monotonic outputvalues; recombining the plurality of monotonic output values into a setof output values; calculating one or more reversible polynomials foreach of the plurality of monotonic input dataset lists; and generatingone or more quantum circuits for each of the one or more reversiblepolynomials.
 11. The method of claim 10, further comprising providing aparallel code generator.
 12. The method of claim 10, further comprisingproviding a reversible polynomial generator.
 13. The method of claim 10,further comprising providing a quantum circuit generator.
 14. The methodof claim 10, wherein the multiple attribute TALP splines are reversible.15. The method of claim 10, further comprising creating one or morequantum logic gates.
 16. A computer processing method of treatingmultiple dimensional polynomial interactions as linear, comprising:separating input variable attribute values by one or more dimensionsusing a hierarchical looping structure of an algorithm as a dimensionalseparator; constructing a unique series of monotonic, or splinedmonotonic, polynomials per dimension linked via one or more commontemporal dimensions; generating a monotonic non-linear framework whichcorresponds to the one or more dimensions of one or more monotonicnon-linear curve values such that the monotonic non-linear curve valuesappear linear when plotted within the monotonic non-linear framework;plotting one or more monotonic non-linear polynomial values on each ofthe one or more dimensions; determining a relationship betweenpolynomials of each of the one or more monotonic non-linear frameworkdimensions using one or more binding temporal components; andcalculating interactions of multiple monotonic non-linear multipledimensional polynomials as linear interactions within the monotonicnon-linear framework.
 17. The method of claim 16, further comprisinggenerating pseudo-linear time-position and position-time predictionpolynomials for each dimension.
 18. The method of claim 16, furthercomprising calculating intersection points for pseudo-linear interactingpolynomials in each dimension.
 19. The method of claim 16, furthercomprising processing pseudo-linear polynomial interactions of eachdimension separately and in parallel to decrease processing time. 20.The method of claim 16, further comprising combining intersection pointsof each dimension into a complete multidimensional intersection pointand time.